Solution of a polynomial system of equations via the eigenvector computation
نویسندگان
چکیده
We propose new techniques and algorithms for the solution of a poly nomial system of equations by matrix methods For such a system we seek its speci ed root at which a xed polynomial takes its maximum or minimum absolute value on the set of roots We unify several known ap proaches and simplify the solution substantially in particular in the case of an overconstrained polynomial system having only a simple root or a few roots We reduce the solution to the computation of the eigenvector of an associated dense matrix but we de ne this matrix implicitly as a Schur complement in a sparse and structured matrix and then modify the known methods for sparse eigenvector computation This enables the acceleration of the solution by roughly factor D the number of roots Our experiments show that the computations can be performed numeri cally with no increase of the computational precision and the iteration converges to the speci ed root quite fast
منابع مشابه
Numerical Solution of Interval Volterra-Fredholm-Hammerstein Integral Equations via Interval Legendre Wavelets Method
In this paper, interval Legendre wavelet method is investigated to approximated the solution of the interval Volterra-Fredholm-Hammerstein integral equation. The shifted interval Legendre polynomials are introduced and based on interval Legendre wavelet method is defined. The existence and uniqueness theorem for the interval Volterra-Fredholm-Hammerstein integral equations is proved. Some examp...
متن کاملComputation of a specified root of a polynomial system of equations using eigenvectorsø
We propose new techniques and algorithms for the solution of a polynomial system of equations by matrix methods. For such a system, we seek its specified root, at which a fixed polynomial takes its maximum or minimum absolute value on the set of roots. We unify several known approaches and simplify the solution substantially, in particular in the case of an overconstrained polynomial system hav...
متن کاملNumerical solution of a system of fuzzy polynomial equations by modified Adomian decomposition method
In this paper, we present some efficient numerical algorithm for solving system of fuzzy polynomial equations based on Newton's method. The modified Adomian decomposition method is applied to construct the numerical algorithms. Some numerical illustrations are given to show the efficiency of algorithms.
متن کاملNumerical solution of delay differential equations via operational matrices of hybrid of block-pulse functions and Bernstein polynomials
In this paper, we introduce hybrid of block-pulse functions and Bernstein polynomials and derive operational matrices of integration, dual, differentiation, product and delay of these hybrid functions by a general procedure that can be used for other polynomials or orthogonal functions. Then, we utilize them to solve delay differential equations and time-delay system. The method is based upon e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001